Total Inter%2DCarrier Interference Cancellation for MC%2DCDMA System in Mobile Environment.

Construction of GIS scientific experience zone based on experience learning theory and constructivism.

On Improving Learning Outcomes Through Sharing of Learning Experiences.

Research of knowledge evolution system on simulation of human scientific knowledge.

A Novel Chinese Text Feature Selection Method Based on Probability Latent Semantic Analysis.

A Combined Iteration Method for Probabilistic Load Flow Calculation Applied to Grid%2DConnected Induction Wind Power System.

Classifier Ensemble for Uncertain Data Stream Classification.

Naive Bayes Classifier for Positive Unlabeled Learning with Uncertainty.

Associative Classifier for Uncertain Data.

PAPR Analysis for SOFDM and NC%2DSOFDM Systems in Cognitive Radio.

Unified collaborative filtering model based on combination of latent features.

Novel overlay%2Funderlay cognitive radio waveforms using SD%2DSMSE framework to enhance spectrum efficiency%2Dpart II analysis in fading channels.

Trust in RFID%2Denabled Supply%2DChain Management.

A software%2Ddefined radio based cognitive radio demonstration over FM band.

Advanced Data Mining and Applications
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a proper support of multiple Top-k queries in order to perform projected clustering. Although some research tackles to problem of optimizing restricted ranking (top-k) queries, there is no solution considering more than one single ranking criterion. This deficit- optimizing multiple Topk queries over joins- is targeted by this paper from two perspectives. On the one hand, we propose a minimal but quite handy extension of SQL to express multiple top-k queries. On the other hand, we propose an optimized hash join strategy to efficiently execute this type of queries. Extensive experiments conducted in this context show the feasibility of our proposal. 1.
Ranking%2DConstrained Keyword Sequence Extraction from Web Documents.

Dimension%2DSpecific Search for Multimedia Retrieval.

Dimension%2DSpecific Search for Multimedia Retrieval.

The Research of the Non%2Duniformity in Land Use Map Patches and Image Segments.

Intercarrier Interference Immune Single Carrier OFDM via Magnitude Shift Keying Modulation.

A software%2Ddefined radio based cognitive radio demonstration over FM band.

High performance frequency division MC%2DCDMA system via carrier interferometry codes.

A software%2Ddefined radio based cognitive radio demonstration over FM band.

Inter%2Dcarrier interference self%2Dcancellation in synchronous downlink MC%2DCDMA system.

Trust Framework for RFID Tracking in Supply Chain Management.

OcVFDT one%2Dclass very fast decision tree for one%2Dclass classification of data streams.

Optimal Lifetime Model of Heterogeneous Surveillance Sensor Network in Cellular Coverage Condition.

A novel highly accurate log skew normal approximation method to lognormal sum distributions.

K%2DMeans and K%2DMedoids.
Abstract: Problem statement: Clustering is one of the most important research areas in the field of data mining. Clustering means creating groups of objects based on their features in such a way that the objects belonging to the same groups are similar and those belonging to different groups are dissimilar. Clustering is an unsupervised learning technique. The main advantage of clustering is that interesting patterns and structures can be found directly from very large data sets with little or none of the background knowledge. Clustering algorithms can be applied in many domains. Approach: In this research, the most representative algorithms K-Means and K-Medoids were examined and analyzed based on their basic approach. The best algorithm in each category was found out based on their performance. The input data points are generated by two ways, one by using normal distribution and another by applying uniform distribution. Results: The randomly distributed data points were taken as input to these algorithms and clusters are found out for each algorithm. The algorithms were implemented using JAVA language and the performance was analyzed based on their clustering quality. The execution time for the algorithms in each category was compared for different runs. The accuracy of the algorithm was investigated during different execution of the program on the input data points. Conclusion: The average time taken by K-Means algorithm is greater than the time taken by K-Medoids algorithm for both the case of normal and uniform distributions. The results proved to be satisfactory. Key words: K-Means clustering, K-Medoids clustering, data clustering, cluster analysis
Database Clustering Methods.
Abstract. The explosive growth of information technology and digital content industry stimulates various video applications over the Internet. Since it is quite easy to copy, reformat, modify and republish video files on the websites, similarity/duplicate detection and measurement is essential to identify the excessive content duplication, so as to facilitate effective video search and intelligence propriety protection as well. In this paper, we propose a novel signature-based approach for duplicate video comparison. The so-called video histogram scheme counts the numbers of video’s frames that are closest to a set of representative seed vectors chosen from the feature space of the training data set in advance. Then all the numbers are normalized to generate the signature of the video for further comparison. As our signature is a compact fixed-size vector with low dimension for each video, it requires less storage and computation cost than previous methods. The experiments show that our approach is both efficient and effective for web video duplicate detection. 1
Projected outlier detection in high%2Ddimensional mixed%2Dattributes data set.

RFID Infrastructure Design A Case Study of Two Australian RFID Projects.
The design, implementation, and deployment of large-scale RFID infrastructures can occur only through innovative solutions that address RFID challenges at all levels, including device, data processing, and data integration. The authors present and discuss several design issues associated with two Australian national RFID projects, implemented based on the EPCglobal Network. Using practical experience gained from these projects, they identify several areas of improvement and research opportunities for future large-scale RFID implementations and deployments.
Novel overlay%2Funderlay cognitive radio waveforms using SD%2DSMSE framework to enhance spectrum efficiency%2D part i theoretical framework and analysis in AWGN channel.

Ambiguous decision trees for mining concept%2Ddrifting data streams.

Instance optimal query processing in spatial networks.

Advanced Data Mining and Applications
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a proper support of multiple Top-k queries in order to perform projected clustering. Although some research tackles to problem of optimizing restricted ranking (top-k) queries, there is no solution considering more than one single ranking criterion. This deficit- optimizing multiple Topk queries over joins- is targeted by this paper from two perspectives. On the one hand, we propose a minimal but quite handy extension of SQL to express multiple top-k queries. On the other hand, we propose an optimized hash join strategy to efficiently execute this type of queries. Extensive experiments conducted in this context show the feasibility of our proposal. 1.
Data Reduction Approach for Sensitive Association Classification Rule Hiding.

Graph Mining based on a Data Partitioning Approach.

Graph Mining based on a Data Partitioning Approach.



One%2DClass Classification of Text Streams with Concept Drift.

Design of a Dendritic Cells inspired Model Based on Danger Theory for Intrusion Detection System.

A Heuristic Data Reduction Approach for Associative Classification Rule Hiding.

Striking Similarities in Diverse Telomerase Proteins Revealed by Combining Structure Prediction and Machine Learning Approaches.
Telomerase is a ribonucleoprotein enzyme that adds telomeric DNA repeat sequences to the ends of linear chromosomes. The enzyme plays pivotal roles in cellular senescence and aging, and because it provides a telomere maintenance mechanism for ~90 % of human cancers, it is a promising target for cancer therapy. Despite its importance, a highresolution structure of the telomerase enzyme has been elusive, although a crystal structure of an N-terminal domain (TEN) of the telomerase reverse transcriptase subunit (TERT) from Tetrahymena has been reported. In this study, we used a comparative strategy, in which sequence-based machine learning approaches were integrated with computational structural modeling, to explore the potential conservation of structural and functional features of TERT in phylogenetically diverse species. We generated structural models of the N-terminal domains from human and yeast TERT using a combination of threading and homology modeling with the Tetrahymena TEN structure as a template. Comparative analysis of predicted and experimentally verified DNA and RNA binding residues, in the context of these structures, revealed significant similarities in nucleic acid binding surfaces of Tetrahymena and human TEN domains. In addition, the combined evidence from machine learning and structural modeling identified several specific amino acids that are likely to play a role in binding DNA or RNA, but for which no experimental evidence is currently available. 1.
On hamiltonian colorings for some graphs.

Enabling Next%2DGeneration RFID Applications Solutions and Challenges.
The design, implementation, and deployment of large-scale RFID infrastructures can occur only through innovative solutions that address RFID challenges at all levels, including device, data processing, and data integration. The authors present and discuss several design issues associated with two Australian national RFID projects, implemented based on the EPCglobal Network. Using practical experience gained from these projects, they identify several areas of improvement and research opportunities for future large-scale RFID implementations and deployments.
Moving Block Sequence and Organizational Evolutionary Algorithm for General Floorplanning With Arbitrarily Shaped Rectilinear Blocks.

Advanced Data Mining and Applications
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a proper support of multiple Top-k queries in order to perform projected clustering. Although some research tackles to problem of optimizing restricted ranking (top-k) queries, there is no solution considering more than one single ranking criterion. This deficit- optimizing multiple Topk queries over joins- is targeted by this paper from two perspectives. On the one hand, we propose a minimal but quite handy extension of SQL to express multiple top-k queries. On the other hand, we propose an optimized hash join strategy to efficiently execute this type of queries. Extensive experiments conducted in this context show the feasibility of our proposal. 1.
Supervised Dimensionality Reduction on Streaming Data.
We propose a sliding-window approach for the dimensionality reduction for linear discriminant analysis(LDA) on streaming data. Streaming data are time variant and can be in high dimensions. When a sliding window is moving along data stream, the data that have passed out of the window will be forgotten (i.e., deleted).We propose a LDA dimensionality reduction algorithm based on different sliding windows. The experiments on UCI data sets have been conducted and results are compared with the batch IDR/QR LDA method. It is shown that our algorithm present an efficient solution to the problem of dimensionality reduction on streaming data yet still have a good performance on computational cost and the classification accuracy. 1.
Who Is Taking over Control%3F A Psychological Perspective in Examining Effects of Agent%2DBased Negotiation Support Technologies.

Blind Separation of Positive Signals by Using Genetic Algorithm.

Online Rare Events Detection.

Discovering Correlated Items in Data Streams.

A Recommender System with Interest%2DDrifting.

An improved Naive Bayesian classifier with advanced discretisation method.

Collaborative filtering on streaming data with interest%2Ddrifting.

Design a Knowledge%2DBased System to Automatically Assess Commercial Websites.

An Efficient Measure of Signal Temporal Predictability for Blind Source Separation.


Advanced Data Mining and Applications
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a proper support of multiple Top-k queries in order to perform projected clustering. Although some research tackles to problem of optimizing restricted ranking (top-k) queries, there is no solution considering more than one single ranking criterion. This deficit- optimizing multiple Topk queries over joins- is targeted by this paper from two perspectives. On the one hand, we propose a minimal but quite handy extension of SQL to express multiple top-k queries. On the other hand, we propose an optimized hash join strategy to efficiently execute this type of queries. Extensive experiments conducted in this context show the feasibility of our proposal. 1.

Document generality its computation for ranking.

A reconstruction%2Dbased algorithm for classification rules hiding.
Data sharing between two organizations is common in many application areas e.g. business planing or marketing. Useful global patterns can be discovered from the integrated dataset. However, some sensitive patterns that should have been kept private could also be discovered. In general, disclosure of sensitive patterns could decrease the competitive ability of the data owner. Therefore, sensitive patterns should be hidden before data sharing starts. To address this problem, released datasets must be modified unavoidably. However, if the overall characteristics of the dataset can be maintained, the dataset is still usable perfectly. Therefore, not only the privacy should be concerned, but also the usability. In this paper, we propose a new algorithm to preserve the privacy of the classification rules by using reconstruction technique for categorical datasets. Firstly, all discovered classification rules in the released dataset are presented to the data owner to identify sensitive rules that should be hidden. Subsequently, remained non-sensitive rules along with extracted characteristics information of the dataset are used to build a decision tree. Finally, the new dataset which contains only non-sensitive classification rules is reconstructed from the tree. From empirical studies, our algorithm can preserve the privacy e#ectively. Additionally, the usability of the datasets can also be preserved.
Recency%2Dbased collaborative filtering.

Concept%2Dbased document readability in domain specific information retrieval.
Although Web search engines have become information gateways to the Internet, for queries containing technical terms, search results often contain pages that are difficult to be understood by nonexpert users. Therefore, re-ranking search results in a descending order of their comprehensibility should be effective for non-expert users. In our approach, the comprehensibility of Web pages is estimated considering both the document readability and the difficulty of technical terms in the domain of search queries. To extract technical terms, we exploit the domain knowledge extracted from Wikipedia. Our proposed method can be applied to general Web search engines as Wikipedia includes nearly every field of human knowledge. We demonstrate the usefulness of our approach by user experiments.
Class%2Dbased bandwidth allocation and admission control for QoS VPN with DiffServ.


A Neural Network based Technique for Automatic Classification of Road Cracks.


Statistical inference for the common mean of two log%2Dnormal distributions and some applications in reliability.

A Class of Self%2DStabilizing MCA Learning Algorithms.

Categorizing web features and functions to evaluate commercial web sites An assessment framework and an empirical investigation of Australian companies.

Special issue on advances in data mining and its applications.

Fitness assessment of document model.

Can exclusive clustering on streaming data be achieved%3F

Advanced Data Mining and Applications
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a proper support of multiple Top-k queries in order to perform projected clustering. Although some research tackles to problem of optimizing restricted ranking (top-k) queries, there is no solution considering more than one single ranking criterion. This deficit- optimizing multiple Topk queries over joins- is targeted by this paper from two perspectives. On the one hand, we propose a minimal but quite handy extension of SQL to express multiple top-k queries. On the other hand, we propose an optimized hash join strategy to efficiently execute this type of queries. Extensive experiments conducted in this context show the feasibility of our proposal. 1.
Determining the Fitness of a Document Model by Using Conflict Instances.

Time weight collaborative filtering.

Effectiveness of Document Representation for Classification.
Abstract. New trends such as increased product complexity, changing customer requirements and shortening development time, have given rise to an increase in the number of unexpected events within the Product Development Process (PDP). Traditional tools are only partially adequate (either insufficient coverage or simply too late) to cover these unexpected events. As such, new tools are being sought to complement traditional ones. This paper investigates the use of one such tool, textual data mining, for the purpose of facilitating fast feedback. The motivation for this paper stems from the need to handle widely ignored and “loosely structured textual data ” within the PDP. In particular this study would focus on the automated classification of call center records from a Multi National Company (MNC). Different document representation schemes are studied in view of determining the most appropriate scheme that maximizes classification accuracy. 1
Hiding Classification Rules for Data Sharing with Privacy Preservation.
Abstract. In this paper, we propose a method of hiding sensitive classification rules from data mining algorithms for categorical datasets. Our approach is to reconstruct a dataset according to the classification rules that have been checked and agreed by the data owner for releasing to data sharing. Unlike the other heuristic modification approaches, firstly, our method classifies a given dataset. Subsequently, a set of classification rules is shown to the data owner to identify the sensitive rules that should be hidden. After that we build a new decision tree that is constituted only non-sensitive rules. Finally, a new dataset is reconstructed. Our experiments show that the sensitive rules can be hidden completely on the reconstructed datasets. While non-sensitive rules are still able to discovered without any side effect. Moreover, our method can also preserve high usability of reconstructed datasets. 1
Efficient Spatial Clustering Algorithm Using Binary Tree.

Direct Fingerprinting on Multicasting Compressed Video.
A video fingerprint is a kind of digital watermark used in digital video for tracking pirate copies in a multi-user environment. Different users receive the same video with different watermarks designed for uniquely identifying designated users. As a value-added business service, fingerprinting is independent from video compression. In current fingerprinting schemes, a compressed video has to be decoded once for every user in order to add on individual fingerprints. Then the video is encoded again before the dispatch. However, the multiple decode/re-encode operations can result in poor system performance. In this paper, we propose a new integrated fingerprint algorithm, which can be applied directly to the compressed video without decoding/reencoding. Our experiments show that the performance of fingerprinting improved with no compromise to the robustness.
Finding Temporal Features of Event%2DOriented Patterns.

Collaborative Filtering on Data Streams.

Document Re%2Dranking by Generality in Bio%2Dmedical Information Retrieval.

Intelligent Business Portals.
Organization..........................................................................................................................................12
Enhancing security of frequency domain video encryption.

Reflective Web Interface Agent.

A Correlation Analysis on LSA and HAL Semantic Space Models.

Knowledge Maintenance on Data Streams with Concept Drifting.

A Correlation Analysis on LSA and HAL Semantic Space Models.

A sensor%2Dbased multimedia authentication system.

Multimedia authentication with sensor%2Dbased watermarking.

Motion Vector Encryption in Multimedia Streaming.

Finding Negative Event%2DOriented Patterns in Long Temporal Sequences.

PLD A Distillation Algorithm for Misclassified Documents.

A Lightweight Encryption Algorithm for Mobile Online Multimedia Devices.

Web Wrapper Validation.

Introducing Uncertainty into Pattern Discovery in Temporal Event Sequences.

Fuzzy Logic in Web Data Mining for Website Assessment.

Counter Inference of Intelligent Agents.

Order relations among the optimal values under three evaluation criteria and their applications.

A Survey of Schema Evolution in Object%2DOriented Databases.

Type Safety in the Context of Method Updates.

Layered Video Multicast with Retransmissions %28LVMR%29 Evaluation of Hierarchical Rate Control.
Layered Video Multicast with Retransmissions (LVMR) is a system for distributing video  using layered coding over the Internet. The two key contributions of the system are: (1)  improving the quality of reception within each layer by retransmitting lost packets given an  upper bound on recovery time and applying an adaptive playback point scheme to help achieve  more successful retransmission, and (2) adapting to network congestion and heterogeneity using  hierarchical rate control mechanism. This paper concentrates on the rate control aspects of  LVMR. In contrast to the existing sender-based and receiver-based rate control in which the  entire information about network congestion is either available at the sender (in sender-based  approach) or replicated at the receivers (in receiver-based approach), the hierarchical rate control  mechanism distributes the information between the sender, receivers, and some agents in the  network in such a way that each entity maintains only the info...

Bandwidth Control for Replicated%2DStream Multicast Video Distribution.
Real time multicast video distribution is an important component of many multimedia applications. Our work addresses the fairness problem in feedback-controlled multicast video distribution systems over best effort networks (such as the Internet). In previous work we proposed, implemented and experimented with a scheme, called destination set grouping (DSG), where a source maintains a small number of video streams (say 3), carrying the same video but each targeted at receivers with different capabilities. Each stream is feedback-controlled within prescribed limits by its group of receivers. Receivers may move among groups as their capabilities or the capabilities of the network paths leading to them change. In this paper we focus on the potential for network overloading caused by the transmission of multiple replicated streams. We propose a number of mechanisms to be implemented at the source and the receivers that can help avert this problem. We also describe an evaluation of these sc...

A Framework for Method Evolution and Behavior Consistency in Object%2DOriented Databases.

Consistency Checking of Evolving Methods.

Method Restructuring and Consistency Checking for Object%2DOriented Schemas.

Evolution of Methods in Object Schema.

